Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
نویسندگان
چکیده
Many varieties of regular languages have characterizations in terms of forbidden-patterns of their accepting finite automata. The use of patterns while inferring languages belonging to those families through the RPNI-Lang algorithm help to avoid overgeneralization in the same way as negative samples do. The aim of this paper is to describe and prove the convergence of a modification of the RPNI-Lang algorithm that we call FCRPNI. Preliminary experiments done seem to show that the convergence when we use FCRPNI for some subfamilies of regular languages is achieved faster than when we use just the RPNI algorithm.
منابع مشابه
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملInferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called the independence relation. This algorithm is similar to the RPNI algorithm, but it is based on Asynchronous Cellular Automata. For this purpose, we define Asynchronous Cellular Moore Machines and implement the merge ...
متن کاملInferring Uniquely Terminating Regular Languages from Positive Data
We define a new subclass of regular languages, called uniquely terminating regular languages, which can be inferred from positive data. The class of uniquely terminating regular languages and the previously known subclasses of regular languages inferable from positive data are incomparable.
متن کاملExperimental assessment of connectionist regular inference from positive and negative examples
In this paper the ability of recurrent neural networks RNNs for regular inference RI from positive and negative examples is investigated As in some previous works RNNs were trained to learn the string classi cation task from samples of some target regular languages In addition an automaton extraction method was applied to each one of the trained nets to obtain a description of the inference out...
متن کاملForbidden Lifts (np and Csp for Combinatorists)
We present a definition of the class NP in combinatorial context as the class of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they correspond to naturally defined (and intensively studied) combinatorial problems. We show that some types of combinatorial problems like edge colorings and gra...
متن کامل